منابع مشابه
IJASCSE, Vol1 Issue 2, 2012
Towards next generation, Criminal activity in virtual worlds is becoming a major problem for law enforcement agencies. Virtual communities such as Second Life will be quickly becoming the next frontier of cybercrime. Even now a day’s Forensic investigators are becoming interested in being able to accurately and automatically track people in virtual communities. Mostly in the multimedia context,...
متن کامل, Vol1. No.1, JIC, Journal of Informaiton and Computing Science
Abstract. In this paper, a method is employed to approximate the solution of two-dimensional nonlinear Volterra integro-differential equations (2DNVIDEs) with supplementary conditions. First, we introduce twodimensional Legendre polynomials, then convert 2DNVIDEs to the two-dimensional linear Volterra integrodifferential equations (2DLVIDEs). Using this properties and collocation points, reduce...
متن کاملVol1. No.1, JIC, Journal of Informaiton and Computing Science
In this paper an interesting property of the restarted FOM algorithm for solving large nonsymmetric linear systems is presented and studied. By establishing a relationship between the convergence of its residual vectors and the convergence of Ritz values in the Arnoldi procedure, it is shown that some important information of previous FOM(m) cycles may be saved by the iteration approximates at ...
متن کامل, Vol1. No.1, JIC, Journal of Informaiton and Computing Science
In this paper, based on Lyapunov stability theory, a scheme to realize finite-time hybrid synchronization of time-delay hyperchaotic Lorenz system is proposed. By theoretical analysis, the controllers are constructed. Finally, numerical simulations are given to verify the theoretical results.
متن کاملJournal of Information and Computing Science, JIC, Vol1 2006 No1
( , ) k s SAT − is the propositional satisfiable problem restricted to instances where each clause has exactly k distinct literals and every variable occurs at most s times. It is known that there exits an exponential function f such that for ( ) s f k ≤ , all ( , ) k s SAT − instances are satisfiable, but ( , ( ) 1) k f k SAT + − is already NPcomplete ( 3 k ≥ ). Therefore, we call the function...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Initiation
سال: 1970
ISSN: 2091-0088
DOI: 10.3126/init.v1i0.2670